Computational Grid System Load Balancing Using an Efficient Scheduling Technique

نویسندگان

  • Prakash Kumar
  • Pradeep Kumar
  • Vikas Kumar
چکیده

Grid computing is the collection of computer resources from various locations to achieve a common goal. Grid computing is a type of parallel system which enables the dynamically selection, aggregation and distribution of geologically resources at run time depending on their user quality of self service requirement, availability, performance, cost, capability. Load balancing is very effective technique to reduce response time and to improve resources utilization, exploiting through proper distribution of the application. Assuming homogeneous set of nodes linked with homogeneous and fast networks, various load balancing algorithms were developed. Analyzing the past results and to improve the performance and throughput, proposed efficient algorithms with better scheduling policies.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Task Scheduling Using Particle Swarm Optimization Algorithm with a Selection Guide and a Measure of Uniformity for Computational Grids

In this paper, we proposed an algorithm for solving the problem of task scheduling using particle swarm optimization algorithm, with changes in the Selection and removing the guide and also using the technique to get away from the bad, to move away from local extreme and diversity. Scheduling algorithms play an important role in grid computing, parallel tasks Scheduling and sending them to ...

متن کامل

Task Scheduling Using Particle Swarm Optimization Algorithm with a Selection Guide and a Measure of Uniformity for Computational Grids

In this paper, we proposed an algorithm for solving the problem of task scheduling using particle swarm optimization algorithm, with changes in the Selection and removing the guide and also using the technique to get away from the bad, to move away from local extreme and diversity. Scheduling algorithms play an important role in grid computing, parallel tasks Scheduling and sending them to ...

متن کامل

A Dynamic Load Balancing Algorithm in Computational Grid Using Fair Scheduling

Grid Computing has emerged as an important new field focusing on resource sharing. One of the most challenging issues in Grid Computing is efficient scheduling of tasks. In this paper, we propose a Load balancing algorithm for fair scheduling, and we compare it to other scheduling schemes such as the Earliest Deadline First, Simple Fair Task order, Adjusted Fair Task Order and Max Min Fair Sche...

متن کامل

Job Scheduling in Computational Grid using the Intelligence of Hybrid Fuzzy - Android System

In the computational grid environment, algorithms specified for scheduling plays a vital role in managing the jobs. The main aim of the scheduling algorithms is to allocate the tasks to the availability at the mean time to the suitable resources. The makespan and cost for task execution can be minimized by an efficient task scheduling algorithm; it also helps to improve the load balancing among...

متن کامل

A Budget and Deadline Constrained Fault Tolerant Load Balanced Scheduling Algorithm for Computational Grids

Grid is an environment with millions of resources which are dynamic and heterogeneous in nature. A computational grid is one in which the resources are computing nodes and is meant for applications that involves larger computations. A scheduling algorithm is said to be efficient if and only if it performs better resource allocation even in case of resource failure. Resource allocation is a tedi...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2013